Multi-view Locality Low-rank Embedding for Dimension Reduction
نویسندگان
چکیده
منابع مشابه
Multi-view low-rank sparse subspace clustering
Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view data. This paper presents an approach to multi-view subspace clustering that learns a joint subspace representation by constructing affinity matrix shared among all views. Relyi...
متن کاملSigned Laplacian Embedding for Supervised Dimension Reduction
Manifold learning is a powerful tool for solving nonlinear dimension reduction problems. By assuming that the high-dimensional data usually lie on a low-dimensional manifold, many algorithms have been proposed. However, most algorithms simply adopt the traditional graph Laplacian to encode the data locality, so the discriminative ability is limited and the embedding results are not always suita...
متن کاملUnsupervised Locally Linear Embedding for Dimension Reduction
In this paper, Locally Linear Embedding (LLE) has been implemented for unsupervised non-linear dimension reduction that computes low dimensional, neighborhood preserving embeddings of high dimensional data. Inputs are mapped into a single global coordinate system of lower dimensionality, and its optimizations though capable of generating highly nonlinear embeddings but local minima are not invo...
متن کاملKernel Locality Preserving Low-Rank Representation
Classification based on Low-Rank Representation (LRR) has been a hot-topic in the field of pattern classification. However, LRR may not be able to fuse the local and global information of data completely and fail to represent nonlinear samples. In this paper, we propose a kernel locality preserving low-rank representation with Tikhonov regularization (KLP-LRR) for face recognition. KLP-LRR is a...
متن کاملLow-rank Multi-view Clustering in Third-Order Tensor Space
The plenty information from multiple views data as well as the complementary information among different views are usually beneficial to various tasks, e.g., clustering, classification, de-noising. Multi-view subspace clustering is based on the fact that the multi-view data are generated from a latent subspace. To recover the underlying subspace structure, the success of the sparse and/or low-r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge-Based Systems
سال: 2020
ISSN: 0950-7051
DOI: 10.1016/j.knosys.2019.105172